package org.nowcoder.huawei.other;

import java.io.BufferedReader;
import java.io.InputStreamReader;

/**
 * HJ108: 求最小公倍数
 */
public class HJ108 {
    private static void method_1(int a, int b) {
        int k = Math.max(a, b);
        int v = Math.min(a, b);
        int i = 1;

        while (true) {
            int tmp = k * i;
            if (tmp % v == 0) {
                System.out.println(tmp);
                break;
            }
            i++;
        }
    }

    // 求最大公约数
    private static int gcd(int a, int b) {
        return b == 0 ? a : gcd(b, a % b);
    }


    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] vals = br.readLine().split(" ");
        int a = Integer.parseInt(vals[0]);
        int b = Integer.parseInt(vals[1]);

        // //方法一： 较大数的倍数对较小数取余
        //method_1(a,b);

        //方法二： 最小公倍数 = （a * b ）/最大公约数
        System.out.print((a * b) / gcd(a, b));

    }
}
